Controlled Node Splitting
نویسندگان
چکیده
To exploit instruction level parallelism in programs over multiple basic blocks, programs should have reducible control flow graphs. However not all programs satisfy this property. A new method, called Controlled Node Splitting (CNS), for transforming irreducible control flow graphs to reducible control flow graphs is presented. CNS duplicates nodes of the control flow graph to obtain reducible control flow graphs. CNS results in a minimum number of splits and a minimum number of duplicates. Since the computation time to find the optimal split sequence is large, a heuristic has been developed. The results of this heuristic are close to the optimum. Straightforward application of node splitting may result in an average code size increase of 250%. CNS with the heuristic limits the increase to only 3%.
منابع مشابه
Growing Regression Forests by Classification: Applications to Object Pose Estimation
In this work, we propose a novel node splitting method for regression trees and incorporate it into the regression forest framework. Unlike traditional binary splitting, where the splitting rule is selected from a predefined set of binary splitting rules via trial-and-error, the proposed node splitting method first finds clusters of the training data which at least locally minimize the empirica...
متن کاملPerformance of KDB-Trees with Query-Based Splitting
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on these data appeal to a small number of relevant dimensions. Unfortunately, the multidimensional access methods designed for highdimensional data perform rather poorly for these partially specified queries. A potentially ve...
متن کاملPerformance Analysis of cooperative SWIPT System: Intelligent Reflecting Surface versus Decode-and-Forward
In this paper, we explore the impacts of utilizing intelligent reflecting surfaces (IRS) in a power-splitting based simultaneous wireless information and power transfer (PS-SWIPT) system and compare its performance with the traditional decode and forward relaying system. To analyze a more practical system, it is also assumed that the receiving nodes are subject to decoding cost, and they are on...
متن کاملKinetics of node splitting in evolving complex networks
We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of “splitting” nodes of degree k into k nodes of degree 1. Four networks are considered, each evolves at each time step by either preferential attachment, with probability p, or splitting with probability 1 − p. Two methods of attachment are considered; first, ...
متن کاملAutomated generation of node‐splitting models for assessment of inconsistency in network meta‐analysis
Network meta-analysis enables the simultaneous synthesis of a network of clinical trials comparing any number of treatments. Potential inconsistencies between estimates of relative treatment effects are an important concern, and several methods to detect inconsistency have been proposed. This paper is concerned with the node-splitting approach, which is particularly attractive because of its st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996